package dp01;

/**
 * 题目：买卖股票的最佳时机含手续费
 * 题目链接：https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/description/
 */
public class Solution13 {
    public int maxProfit(int[] prices, int fee) {
        int n = prices.length;
        int[][] dp = new int[n][2];     //dp[i][0]表示买入状态，利益最大 ，dp[i][1]表示卖出状态，利益最大
        dp[0][0] = -prices[0];
        for (int i = 1; i < n; i++) {
            dp[i][0] = Math.max(dp[i-1][1]-prices[i],dp[i-1][0]);
            dp[i][1] = Math.max(dp[i-1][0]+prices[i]-fee,dp[i-1][1]);
        }
        return Math.max(dp[n-1][0],dp[n-1][1]);
    }
}
